An even simpler proof of Opial’s inequality
نویسندگان
چکیده
منابع مشابه
FM-KZ: An even simpler alphabet-independent FM-index
In an earlier work [6] we presented a simple FM-index variant, based on the idea of Huffman-compressing the text and then applying the Burrows-Wheeler transform over it. The main drawback of using Huffman was its lack of synchronizing properties, forcing us to supply another bit stream indicating the Huffman codeword boundaries. In this way, the resulting index needed O(n(H0+1)) bits of space b...
متن کاملAn information - theoretic proof of Hadamard's inequality
only linearly and not exponentially with the source block length. Since a trellis approaches a tree as the constraint length grows large, this work also suggests an alternate tree coding scheme and proof of the tree coding theorem of Jakatdar and Pearlman [6]. APPENDIX A The generalized Gallager function Edk(p) is defined in (21). In the following we prove that given RN,* > RN-*(De) for allj an...
متن کاملAn information-theoretic proof of Nash's inequality
We show that an information-theoretic property of Shannon's entropy power, known as concavity of entropy power [7], can be fruitfully employed to prove inequalities in sharp form. In particular, the concavity of entropy power implies the logarithmic Sobolev inequality, and the Nash's inequality with the sharp constant.
متن کاملAn Entropic Proof of Chang's Inequality
Chang’s lemma is a useful tool in additive combinatorics and the analysis of Boolean functions. Here we give an elementary proof using entropy. The constant we obtain is tight, and we give a slight improvement in the case where the variables are highly biased. 1 The lemma For S ∈ {0, 1}, let χk : {±1} n → R denote the character χS(x) = ∏ i∈S xi . For any function f : {±1} → R, we can then defin...
متن کاملA Simpler proof of Jensen's Coding Theorem
[82] provides a proof of Jensen's remarkable Coding Theorem , which demonstrates that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of strong coding (Friedman [87]). The basic idea is to first choose A ⊆ ORD so that V = L[...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1965
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1965-0170989-6